The Research of the Closed Fuzzy Matroids
نویسندگان
چکیده
The closed fuzzy matroid is a subsystem of the fuzzy matroid theory. Some important conclusions, ideas and methods of the closed fuzzy matroid are briefly introduced and commented in this paper. We try to let readers to know the latest development and results of the closed fuzzy matroids.
منابع مشابه
CATEGORICAL RELATIONS AMONG MATROIDS, FUZZY MATROIDS AND FUZZIFYING MATROIDS
The aim of this paper is to study the categorical relations betweenmatroids, Goetschel-Voxman’s fuzzy matroids and Shi’s fuzzifying matroids.It is shown that the category of fuzzifying matroids is isomorphic to that ofclosed fuzzy matroids and the latter is concretely coreflective in the categoryof fuzzy matroids. The category of matroids can be embedded in that offuzzifying matroids as a simul...
متن کاملStructural properties of fuzzy graphs
Matroids are important combinatorial structures and connect close-lywith graphs. Matroids and graphs were all generalized to fuzzysetting respectively. This paper tries to study connections betweenfuzzy matroids and fuzzy graphs. For a given fuzzy graph, we firstinduce a sequence of matroids from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. A fuzzy matroid, named graph fuzzy matro...
متن کاملCategorical Relations among Matroids, Fuzzy Matroids and Fuzzifying Matroids
The aim of this paper is to study the categorical relations between matroids, Goetschel-Voxman’s fuzzy matroids and Shi’s fuzzifying matroids. It is shown that the category of fuzzifying matroids is isomorphic to that of closed fuzzy matroids and the latter is concretely coreflective in the category of fuzzy matroids. The category of matroids can be embedded in that of fuzzifying matroids as a ...
متن کاملBASES AND CIRCUITS OF FUZZIFYING MATROIDS
In this paper, as an application of fuzzy matroids, the fuzzifying greedy algorithm is proposed and an achievableexample is given. Basis axioms and circuit axioms of fuzzifying matroids, which are the semantic extension for thebasis axioms and circuit axioms of crisp matroids respectively, are presented. It is proved that a fuzzifying matroidis equivalent to a mapping which satisfies the basis ...
متن کاملM-FUZZIFYING MATROIDS INDUCED BY M-FUZZIFYING CLOSURE OPERATORS
In this paper, the notion of closure operators of matroids is generalized to fuzzy setting which is called $M$-fuzzifying closure operators, and some properties of $M$-fuzzifying closure operators are discussed. The $M$-fuzzifying matroid induced by an $M$-fuzzifying closure operator can induce an $M$-fuzzifying closure operator. Finally, the characterizations of $M$-fuzzifying acyclic matroi...
متن کامل